0.06/0.12 % Problem : Vampire---4.8_2781 : TPTP v0.0.0. Released v0.0.0. 0.06/0.13 % Command : run_E %s %d THM 0.15/0.34 % Computer : n012.cluster.edu 0.15/0.34 % Model : x86_64 x86_64 0.15/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.15/0.34 % Memory : 8042.1875MB 0.15/0.34 % OS : Linux 3.10.0-693.el7.x86_64 0.15/0.34 % CPULimit : 1440 0.15/0.34 % WCLimit : 180 0.15/0.35 % DateTime : Mon Jul 3 12:42:37 EDT 2023 0.15/0.35 % CPUTime : 0.21/0.47 Running higher-order theorem provingRunning: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox2/tmp/tmp.qdLXK4Jg3d/Vampire---4.8_2781 0.21/0.47 # Version: 3.1pre001-ho 0.21/0.48 # Preprocessing class: HSMSSMSSSSSNFFN. 0.21/0.48 # Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 0.21/0.48 # Starting new_ho_10 with 900s (5) cores 0.21/0.48 # Starting new_bool_1 with 180s (1) cores 0.21/0.48 # Starting full_lambda_5 with 180s (1) cores 0.21/0.48 # Starting new_ho_10_unif with 180s (1) cores 0.21/0.48 # new_bool_1 with pid 2962 completed with status 0 0.21/0.48 # Result found by new_bool_1 0.21/0.48 # Preprocessing class: HSMSSMSSSSSNFFN. 0.21/0.48 # Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 0.21/0.48 # Starting new_ho_10 with 900s (5) cores 0.21/0.48 # Starting new_bool_1 with 180s (1) cores 0.21/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0) 0.21/0.48 # Search class: HGUNF-FFSF22-SFFFFFNN 0.21/0.48 # Scheduled 5 strats onto 1 cores with 180 seconds (180 total) 0.21/0.48 # Starting new_ho_10 with 109s (1) cores 0.21/0.48 # new_ho_10 with pid 2965 completed with status 0 0.21/0.48 # Result found by new_ho_10 0.21/0.48 # Preprocessing class: HSMSSMSSSSSNFFN. 0.21/0.48 # Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 0.21/0.48 # Starting new_ho_10 with 900s (5) cores 0.21/0.48 # Starting new_bool_1 with 180s (1) cores 0.21/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0) 0.21/0.48 # Search class: HGUNF-FFSF22-SFFFFFNN 0.21/0.48 # Scheduled 5 strats onto 1 cores with 180 seconds (180 total) 0.21/0.48 # Starting new_ho_10 with 109s (1) cores 0.21/0.48 # Preprocessing time : 0.001 s 0.21/0.48 # Presaturation interreduction done 0.21/0.48 0.21/0.48 # Proof found! 0.21/0.48 # SZS status Theorem 0.21/0.48 # SZS output start CNFRefutation 0.21/0.48 thf(decl_22, type, x: frac). 0.21/0.48 thf(decl_23, type, y: frac). 0.21/0.48 thf(decl_24, type, z: frac). 0.21/0.48 thf(decl_25, type, u: frac). 0.21/0.48 thf(decl_26, type, moref: frac > frac > $o). 0.21/0.48 thf(decl_27, type, eq: frac > frac > $o). 0.21/0.48 thf(decl_28, type, pf: frac > frac > frac). 0.21/0.48 thf(satz44, axiom, ![X2:frac, X3:frac, X4:frac, X5:frac]:(((moref @ X2 @ X3)=>((eq @ X2 @ X4)=>((moref @ X4 @ X5)<=(eq @ X3 @ X5))))), file('/export/starexec/sandbox2/tmp/tmp.qdLXK4Jg3d/Vampire---4.8_2781', satz44)). 0.21/0.48 thf(satz56, axiom, ![X2:frac, X3:frac, X4:frac, X5:frac]:((((eq @ X4 @ X5)=>(eq @ (pf @ X2 @ X4) @ (pf @ X3 @ X5)))<=(eq @ X2 @ X3))), file('/export/starexec/sandbox2/tmp/tmp.qdLXK4Jg3d/Vampire---4.8_2781', satz56)). 0.21/0.48 thf(satz61, axiom, ![X2:frac, X3:frac, X4:frac]:(((moref @ (pf @ X2 @ X4) @ (pf @ X3 @ X4))<=(moref @ X2 @ X3))), file('/export/starexec/sandbox2/tmp/tmp.qdLXK4Jg3d/Vampire---4.8_2781', satz61)). 0.21/0.48 thf(satz37, axiom, ![X2:frac]:((eq @ X2 @ X2)), file('/export/starexec/sandbox2/tmp/tmp.qdLXK4Jg3d/Vampire---4.8_2781', satz37)). 0.21/0.48 thf(n, axiom, (~((moref @ z @ u))=>(eq @ z @ u)), file('/export/starexec/sandbox2/tmp/tmp.qdLXK4Jg3d/Vampire---4.8_2781', n)). 0.21/0.48 thf(satz65b, conjecture, (moref @ (pf @ x @ z) @ (pf @ y @ u)), file('/export/starexec/sandbox2/tmp/tmp.qdLXK4Jg3d/Vampire---4.8_2781', satz65b)). 0.21/0.48 thf(satz64, axiom, ![X2:frac, X3:frac, X4:frac, X5:frac]:(((moref @ X2 @ X3)=>((moref @ X4 @ X5)=>(moref @ (pf @ X2 @ X4) @ (pf @ X3 @ X5))))), file('/export/starexec/sandbox2/tmp/tmp.qdLXK4Jg3d/Vampire---4.8_2781', satz64)). 0.21/0.48 thf(m, axiom, (moref @ x @ y), file('/export/starexec/sandbox2/tmp/tmp.qdLXK4Jg3d/Vampire---4.8_2781', m)). 0.21/0.48 thf(c_0_8, plain, ![X2:frac, X3:frac, X4:frac, X5:frac]:(((moref @ X2 @ X3)=>((eq @ X2 @ X4)=>((eq @ X3 @ X5)=>(moref @ X4 @ X5))))), inference(fof_simplification,[status(thm)],[satz44])). 0.21/0.48 thf(c_0_9, plain, ![X2:frac, X3:frac, X4:frac, X5:frac]:(((eq @ X2 @ X3)=>((eq @ X4 @ X5)=>(eq @ (pf @ X2 @ X4) @ (pf @ X3 @ X5))))), inference(fof_simplification,[status(thm)],[satz56])). 0.21/0.48 thf(c_0_10, plain, ![X26:frac, X27:frac, X28:frac, X29:frac]:((~(moref @ X26 @ X27)|(~(eq @ X26 @ X28)|(~(eq @ X27 @ X29)|(moref @ X28 @ X29))))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])). 0.21/0.48 thf(c_0_11, plain, ![X33:frac, X34:frac, X35:frac, X36:frac]:((~(eq @ X33 @ X34)|(~(eq @ X35 @ X36)|(eq @ (pf @ X33 @ X35) @ (pf @ X34 @ X36))))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])). 0.21/0.48 thf(c_0_12, plain, ![X2:frac, X3:frac, X4:frac]:(((moref @ X2 @ X3)=>(moref @ (pf @ X2 @ X4) @ (pf @ X3 @ X4)))), inference(fof_simplification,[status(thm)],[satz61])). 0.21/0.48 thf(c_0_13, plain, ![X2:frac, X3:frac, X4:frac, X5:frac]:(((moref @ X4 @ X5)|~((moref @ X2 @ X3))|~((eq @ X2 @ X4))|~((eq @ X3 @ X5)))), inference(split_conjunct,[status(thm)],[c_0_10])). 0.21/0.48 thf(c_0_14, plain, ![X2:frac, X3:frac, X4:frac, X5:frac]:(((eq @ (pf @ X2 @ X4) @ (pf @ X3 @ X5))|~((eq @ X2 @ X3))|~((eq @ X4 @ X5)))), inference(split_conjunct,[status(thm)],[c_0_11])). 0.21/0.48 thf(c_0_15, plain, ![X30:frac, X31:frac, X32:frac]:((~(moref @ X30 @ X31)|(moref @ (pf @ X30 @ X32) @ (pf @ X31 @ X32)))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])). 0.21/0.48 thf(c_0_16, plain, ![X2:frac, X5:frac, X7:frac, X6:frac, X4:frac, X3:frac]:(((moref @ X2 @ (pf @ X3 @ X4))|~((moref @ X5 @ (pf @ X6 @ X7)))|~((eq @ X5 @ X2))|~((eq @ X7 @ X4))|~((eq @ X6 @ X3)))), inference(spm,[status(thm)],[c_0_13, c_0_14])). 0.21/0.48 thf(c_0_17, plain, ![X2:frac, X4:frac, X3:frac]:(((moref @ (pf @ X2 @ X4) @ (pf @ X3 @ X4))|~((moref @ X2 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_15])). 0.21/0.48 thf(c_0_18, plain, ![X37:frac]:((eq @ X37 @ X37)), inference(variable_rename,[status(thm)],[satz37])). 0.21/0.48 thf(c_0_19, plain, (~(moref @ z @ u)=>(eq @ z @ u)), inference(fof_simplification,[status(thm)],[n])). 0.21/0.48 thf(c_0_20, negated_conjecture, ~(moref @ (pf @ x @ z) @ (pf @ y @ u)), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[satz65b])])). 0.21/0.48 thf(c_0_21, plain, ![X22:frac, X23:frac, X24:frac, X25:frac]:((~(moref @ X22 @ X23)|(~(moref @ X24 @ X25)|(moref @ (pf @ X22 @ X24) @ (pf @ X23 @ X25))))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[satz64])])). 0.21/0.48 thf(c_0_22, plain, ![X2:frac, X4:frac, X3:frac, X5:frac, X6:frac, X7:frac]:(((moref @ X2 @ (pf @ X3 @ X4))|~((eq @ (pf @ X5 @ X6) @ X2))|~((eq @ X6 @ X4))|~((eq @ X7 @ X3))|~((moref @ X5 @ X7)))), inference(spm,[status(thm)],[c_0_16, c_0_17])). 0.21/0.48 thf(c_0_23, plain, ![X2:frac]:((eq @ X2 @ X2)), inference(split_conjunct,[status(thm)],[c_0_18])). 0.21/0.48 thf(c_0_24, plain, ((moref @ z @ u)|(eq @ z @ u)), inference(fof_nnf,[status(thm)],[c_0_19])). 0.21/0.48 thf(c_0_25, negated_conjecture, ~((moref @ (pf @ x @ z) @ (pf @ y @ u))), inference(split_conjunct,[status(thm)],[c_0_20])). 0.21/0.49 thf(c_0_26, plain, ![X2:frac, X3:frac, X4:frac, X5:frac]:(((moref @ (pf @ X2 @ X4) @ (pf @ X3 @ X5))|~((moref @ X2 @ X3))|~((moref @ X4 @ X5)))), inference(split_conjunct,[status(thm)],[c_0_21])). 0.21/0.49 thf(c_0_27, plain, (moref @ x @ y), inference(split_conjunct,[status(thm)],[m])). 0.21/0.49 thf(c_0_28, plain, ![X2:frac, X4:frac, X5:frac, X3:frac, X6:frac]:(((moref @ (pf @ X2 @ X3) @ (pf @ X4 @ X5))|~((eq @ X3 @ X5))|~((eq @ X6 @ X4))|~((moref @ X2 @ X6)))), inference(spm,[status(thm)],[c_0_22, c_0_23])). 0.21/0.49 thf(c_0_29, plain, ((moref @ z @ u)|(eq @ z @ u)), inference(split_conjunct,[status(thm)],[c_0_24])). 0.21/0.49 thf(c_0_30, negated_conjecture, ~((moref @ z @ u)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25, c_0_26]), c_0_27])])). 0.21/0.49 thf(c_0_31, plain, ![X3:frac, X2:frac, X5:frac, X4:frac]:(((moref @ (pf @ X2 @ X3) @ (pf @ X4 @ X5))|~((eq @ X3 @ X5))|~((moref @ X2 @ X4)))), inference(spm,[status(thm)],[c_0_28, c_0_23])). 0.21/0.49 thf(c_0_32, plain, (eq @ z @ u), inference(sr,[status(thm)],[c_0_29, c_0_30])). 0.21/0.49 thf(c_0_33, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25, c_0_31]), c_0_32]), c_0_27])]), ['proof']). 0.21/0.49 # SZS output end CNFRefutation 0.21/0.49 # Parsed axioms : 17 0.21/0.49 # Removed by relevancy pruning/SinE : 9 0.21/0.49 # Initial clauses : 8 0.21/0.49 # Removed in clause preprocessing : 0 0.21/0.49 # Initial clauses in saturation : 8 0.21/0.49 # Processed clauses : 38 0.21/0.49 # ...of these trivial : 0 0.21/0.49 # ...subsumed : 1 0.21/0.49 # ...remaining for further processing : 37 0.21/0.49 # Other redundant clauses eliminated : 0 0.21/0.49 # Clauses deleted for lack of memory : 0 0.21/0.49 # Backward-subsumed : 1 0.21/0.49 # Backward-rewritten : 0 0.21/0.49 # Generated clauses : 39 0.21/0.49 # ...of the previous two non-redundant : 37 0.21/0.49 # ...aggressively subsumed : 0 0.21/0.49 # Contextual simplify-reflections : 0 0.21/0.49 # Paramodulations : 38 0.21/0.49 # Factorizations : 0 0.21/0.49 # NegExts : 0 0.21/0.49 # Equation resolutions : 0 0.21/0.49 # Total rewrite steps : 4 0.21/0.49 # Propositional unsat checks : 0 0.21/0.49 # Propositional check models : 0 0.21/0.49 # Propositional check unsatisfiable : 0 0.21/0.49 # Propositional clauses : 0 0.21/0.49 # Propositional clauses after purity: 0 0.21/0.49 # Propositional unsat core size : 0 0.21/0.49 # Propositional preprocessing time : 0.000 0.21/0.49 # Propositional encoding time : 0.000 0.21/0.49 # Propositional solver time : 0.000 0.21/0.49 # Success case prop preproc time : 0.000 0.21/0.49 # Success case prop encoding time : 0.000 0.21/0.49 # Success case prop solver time : 0.000 0.21/0.49 # Current number of processed clauses : 27 0.21/0.49 # Positive orientable unit clauses : 3 0.21/0.49 # Positive unorientable unit clauses: 0 0.21/0.49 # Negative unit clauses : 4 0.21/0.49 # Non-unit-clauses : 20 0.21/0.49 # Current number of unprocessed clauses: 12 0.21/0.49 # ...number of literals in the above : 66 0.21/0.49 # Current number of archived formulas : 0 0.21/0.49 # Current number of archived clauses : 10 0.21/0.49 # Clause-clause subsumption calls (NU) : 179 0.21/0.49 # Rec. Clause-clause subsumption calls : 128 0.21/0.49 # Non-unit clause-clause subsumptions : 1 0.21/0.49 # Unit Clause-clause subsumption calls : 7 0.21/0.49 # Rewrite failures with RHS unbound : 0 0.21/0.49 # BW rewrite match attempts : 1 0.21/0.49 # BW rewrite match successes : 0 0.21/0.49 # Condensation attempts : 38 0.21/0.49 # Condensation successes : 0 0.21/0.49 # Termbank termtop insertions : 1685 0.21/0.49 0.21/0.49 # ------------------------------------------------- 0.21/0.49 # User time : 0.006 s 0.21/0.49 # System time : 0.003 s 0.21/0.49 # Total time : 0.009 s 0.21/0.49 # Maximum resident set size: 1804 pages 0.21/0.49 0.21/0.49 # ------------------------------------------------- 0.21/0.49 # User time : 0.008 s 0.21/0.49 # System time : 0.004 s 0.21/0.49 # Total time : 0.012 s 0.21/0.49 # Maximum resident set size: 1728 pages 0.21/0.49 % E---3.1 exiting 0.21/0.49 EOF